#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;

#define in read()
#define pii pair<int,int>
#define fi first
#define se second
#define FILE(x) freopen(x".in","r",stdin);\
	freopen(x".out","w",stdout);
#define pb push_back

int read(){
	int x = 0,sgn = 1;char ch = getchar();
	for(;!isdigit(ch);ch = getchar()) if(ch == '-') sgn = -1;
	for(;isdigit(ch);ch = getchar()) x = (x<<1)+(x<<3)+(ch^48);
	return x*sgn;
}

const int S = 1 << 11;
const int N = 11;

int n,m,k,U;
ll f[S][S],ans;
vector<int> G[N];

int popcnt(int x){int res=0;for(;x;x>>=1)res+=x&1;return res;}

int main (){
#ifndef ONLINE_JUDGE
	freopen("1.in","r",stdin);
#endif
	n = in,m = in,k = in;
	for(int i = 1;i <= m;i++){
		int u = in-1,v = in-1;
		G[u].pb(v); G[v].pb(u);
	}
	U = 1 << n;
	for(int i = 0;i < n;i++) f[1<<i][1<<i] = 1;
	for(int s = 1;s < U;s++){
		for(int t = s;t;t = (t - 1) & s)
			if(f[s][t])
				for(int x = 0;x < n;x++)
					if(s >> x & 1)
						for(int y : G[x])
							if(!(s >> y & 1)){
								int nt;
								if(popcnt(s) == 1) nt = s | 1 << y;
								else nt = t | 1 << y , nt &= (U - 1) ^ (1 << x);
								if(!(nt >> y + 1)) f[s|1<<y][nt] += f[s][t];
							}
	}
	for(int t = 0;t < U;t++) if(popcnt(t) == k) ans += f[U-1][t];
	printf("%lld\n",ans);
	return 0;
}

